A High Performance Channel Sorting Scheduling Algorithm Based On Largest Packet

We present a new algorithm for wavelength division multiplexing (WDM) star optical networks. The resulting protocol is pre-transmission coordination-based without packet collisions. The proposed algorithm tries to schedule the transmission requests of the network, with the assistant of a prediction mechanism. With the prediction of the packet requests the algorithm manages to decrease the calculation time of building the schedule matrix, which consists of the final schedule of the packets of each node of the network. This reduction is achieved by pipelining the computation process, at the same time with the adoption of a new order in which nodes` requests are serviced. This modification of the service order leads to an increment in terms of network throughput and channel utilization. We compare the performance of two algorithms in terms of channel utilization, network throughput and mean time delay, under different sets of channel values and we present the simulation results.